Formal language theory: refining the Chomsky hierarchy
نویسندگان
چکیده
منابع مشابه
Formal language theory: refining the Chomsky hierarchy.
The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are revie...
متن کاملReflection in the Chomsky Hierarchy
The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...
متن کاملDoes Formal Complexity Reflect Cognitive Complexity? Investigating Aspects of the Chomsky Hierarchy in an Artificial Language Learning Study
This study investigated whether formal complexity, as described by the Chomsky Hierarchy, corresponds to cognitive complexity during language learning. According to the Chomsky Hierarchy, nested dependencies (context-free) are less complex than cross-serial dependencies (mildly context-sensitive). In two artificial grammar learning (AGL) experiments participants were presented with a language c...
متن کاملAn Insertion into the Chomsky Hierarchy?
This review paper will report on some recent discoveries in the area of Formal Languages, chie y by F. Otto, G. Buntrock and G. Niemann. These discoveries have pointed out certain break-throughs connected with the concept of growing contextsensitive languages, which originated in the 1980's with a paper by E. Dahlhaus and M.K. Warmuth. One important result is that the deterministic growing cont...
متن کاملTowards a Coalgebraic Chomsky Hierarchy
The Chomsky hierarchy plays a prominent role in the foundations of theoretical computer science relating classes of formal languages of primary importance as well as the grammars and machine models that represent those language classes. It is well-known that regular languages can be captured by coalgebras. They form precisely the image of all finite coalgebras for the set functor X 7→ 2×X under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society B: Biological Sciences
سال: 2012
ISSN: 0962-8436,1471-2970
DOI: 10.1098/rstb.2012.0077